A Quick String Matching Employing Mixing Up
نویسندگان
چکیده
Most of the current string matching algorithms behave slowly when the amount of patterns increases. In this paper a fast matching algorithm named SSEMatch was designed. PHADDW instruction from SSE (Streamed SIMD Extension) set was used in SSEMatch to produce data confusion, by which the patterns can be distributed into pseudo hash address such that there will be less patterns left for verification matching. With the help of PHADDW, the whole matching time was reduced. Our SSEMatch holds a O(n/m) complexity. Experiment shows that similarly to WM algorithm, SSEMatch performs better when the length of the shortest pattern increases. Also when the amount of patterns increases SSEMatch performs better than WM.
منابع مشابه
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search st...
متن کاملFast Hybrid String Matching Algorithm based on the Quick-Skip and Tuned Boyer-Moore Algorithms
The string matching problem is considered as one of the most interesting research areas in the computer science field because it can be applied in many essential different applications such as intrusion detection, search analysis, editors, internet search engines, information retrieval and computational biology. During the matching process two main factors are used to evaluate the performance o...
متن کاملAn innovative platform to improve the performance of exact string matching algorithms
Exact-String-Matching is an essential issue in many computer science applications. Unfortunately, the performance of Exact-String-Matching algorithms, namely, executing time, does not address the needs of these applications. This paper proposes a general platform for improving the existing ExactString-Matching algorithms executing time, called the PXSMAlg platform. The function of this platform...
متن کاملQuick-Skip Search Hybrid Algorithm For The Exact String Matching Problem
The string matching problem occupies a corner stone in many computer science fields because of the fundamental role it plays in various computer applications. Thus, several string matching algorithms have been produced and applied in most operating systems, information retrieval, editors, internet searching engines, firewall interception and searching nucleotide or amino acid sequence patterns ...
متن کاملExperimental Results on String Matching Algorithms
We present experimental results for string matching algorithms which are known to be fast in practice. We compare these algorithms through two aspects: the number of text character inspections and the running time. These experiments show that for large alphabets and small patterns the Quick Search algorithm of Sunday is the most efficient and that for small alphabets and large patterns it is th...
متن کامل